Exact-Order Asymptotic Analysis for Closed Queueing Networks

Clones: CLOsed queueing Networks Exact Sampling

We present Clones, a Matlab toolbox for exact sampling from the stationary distribution of a closed queueing network with finite capacities. This toolbox is based on recent results using a compact representation of sets of states that enables exact sampling from the stationary distribution without considering all initial conditions in the coupling from the past (CFTP) scheme. This representatio...

Some Exact Results on Closed Queueing Networks with Blocking

We obtain equivalencies between closed queueing networks with blocking with respect to buffer capacities and the number of customers in the network. These results can be used in approximations, in the buffer allocation problem as well as to explain the behavior of closed queueing networks with finite buffers. We also present exact efficient solutions for special cases.

Performance Analysis of Closed Queueing Networks - ReadingSample

Higher-order distributional properties in closed queueing networks

In many real-life computer and networking applications, the distributions of service times, or times between arrivals of requests, or both, can deviate significantly from the memoryless negative exponential distribution that underpins the product-form solution for queueing networks. Frequently, the coefficient of variation of the distributions encountered is well in excess of one, which would b...

Perfect Sampling for Multiclass Closed Queueing Networks

In this paper we present an exact sampling method for multiclass closed queuing networks. We consider networks for which stationary distribution does not necessarily have a product form. The proposed method uses a compact representation of sets of states, that is used to derive a bounding chain with significantly lower complexity of one-step transition in the coupling from the past scheme. The ...